Low-complexity sequential lossless coding for piecewise-stationary memoryless sources

Low-complexity sequential lossless coding for piecewise-stationary memoryless sources

Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with abruptly changing statistics. The first method, which improves on Willems’ weighting approach, asymptotically achieves a lower bound on the redundancy, and hence is optimal. The se...

Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case

Low-Complexity Lossless Codes for Image and Video Coding

We describe design of lossless block codes for geometric, Laplacian, and similar distributions frequently arising in image and video coding. Proposed codes can be understood as a generalization of Golomb codes, allowing more precise adaptation to values of parameters of distributions, and resulting in lower redundancy. Design of universal block codes for a class of geometric distributions is al...

On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources

The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average cod...

Noiseless coding theorem proved by induction for finite stationary memoryless information sources

Noiseless coding theorem for finite stationary memoryless information sources is proved by using induction on the number of source symbols and the inequality of geometric and harmonic means.